Heronian Triangles Whose Areas Are Integer Multiples of Their Perimeters
نویسنده
چکیده
We present an improved algorithm for finding all solutions to Goehl’s problem A = mP for triangles, i.e., the problem of finding all Heronian triangles whose area (A) is an integer multiple (m) of the perimeter (P ). The new algorithm does not involve elimination of extraneous rational triangles, and is a true extension of Goehl’s original method.
منابع مشابه
Primitive Heronian Triangles With Integer Inradius and Exradii
It is well known that primitive Pythagorean triangles have integer inradius and exradii. We investigate the generalization to primitive Heronian triangles. In particular, we study the special cases of isosceles triangles and triangles with sides in arithmetic progression. We also give two families of primitive Heronian triangles, one decomposable and one indecomposable, which have integer inrad...
متن کاملHeronian Tetrahedra Are Lattice Tetrahedra
Extending a similar result about triangles, we show that each Heronian tetrahedron may be positioned with integer coordinates. More generally, we show the following: if an integral distance set in R can be positioned with rational coordinates, then it can in fact be positioned with integer coordinates. The proof, which uses the arithmetic of quaternions, is tantamount to an algorithm.
متن کاملProvision for Expansion in the SEAC
133[F].—F. L. Miksa, Table of primitive Pythagorean triangles with their perimeters arranged in ascending order from 119992 to 499998. 506 typewritten leaves on deposit in UMT File. This table is a continuation of UMT 111 \_MTAC, v. 5, p. 28], a table by A. S. Anema to 120000. The introduction gives a table showing the number of triangles whose perimeters do not exceed P for P = 120000 (10000)5...
متن کاملMathematical Meaning and Importance of the Topological Index Z
The role of the topological index, ZG, proposed by the present author in 1971, in various problems and topics in elementary mathematics is introduced, namely, (i) Pascal’s and asymmetrical Pascal’s triangle, (ii) Fibonacci, Lucas, and Pell numbers, (iii) Pell equation, (iv) Pythagorean, Heronian, and Eisenstein triangles. It is shown that all the algebras in these problems can be easily obtaine...
متن کاملA Computer Search for Planar Substitution Tilings with n-Fold Rotational Symmetry
We describe a computer algorithm that searches for substitution rules on a set of triangles, the angles of which are all integer multiples of π/n. We find new substitution rules admitting 7-fold rotational symmetry at many different inflation factors.
متن کامل